Distances, Graphs and Designs
نویسندگان
چکیده
منابع مشابه
Regions, Distances and Graphs
Avoir deux directeurs de thèse, c'est avant tout une richesse et une opportunité d'apprendre deux fois plus. Cela permet d'avoir deux points de vue, et cela forcè a faire ses propres choix. J'ai eu cepriviì ege. Aussi je voudrais remercier Jean et Stefan. D'abord pour m'avoir guidé, con-seillé, motivé; et pour avoir passé tout ce tempsà relire et corriger mes travaux. Mais aussi, et surtout, po...
متن کاملDesigns from Paley Graphs and Peisert Graphs
Fix positive integers p, q, and r so that p is prime, q = p, and q ≡ 1 (mod 4). Fix a graph G as follows: If r is odd or p 6≡ 3 (mod 4), let G be the qvertex Paley graph; if r is even and p ≡ 3 (mod 4), let G be either the q-vertex Paley graph or the q-vertex Peisert graph. We use the subgraph structure of G to construct four sequences of 2-designs, and we compute their parameters. Letting k4 d...
متن کاملRamsey Graphs and Block Designs
This paper establishes a connection between a certain class of Ramsey numbers for graphs and the class of symmetric block designs admitting a polarity. The main case considered here relates the projective planes over Galois fields to the Ramsey numbers R(Ca, Kx „) = f(n). It is shown that, for 2 2 ' 2 2 every prime power q, f(q + 1) = q + q + 2, and f(q ) = q + q + 1.
متن کاملOrdinal Distances in Transfinite Graphs
An ordinal-valued metric, taking its values in the set א1 of all countable ordinals, can be assigned to a metrizable set M of nodes in any transfinite graph. M contains all the nonsingleton nodes, as well as certain singleton nodes. Moreover, this yields a graphical realization of Cantor’s countable ordinals, as well as of the Aristotelian ideas of “potential” and “actual” infinities, the forme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1980
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(80)80050-3